Error-Controllable Simplification of Point Cloud

نویسندگان

  • Yichen Li
  • Mingqiang Wei
  • Jianhuang Wu
  • Mingyong Pang
چکیده

Point cloud simplification has become a vital step in any point-based surface processing pipeline. This paper describes a fast and effective algorithm for point cloud simplification with feature preservation. First, feature points are extracted by thresholding curvatures; Second, for non-feature points, they are covered by distinct balls, the points in each ball are substituted by an optimized point. Thus, the simplified point cloud consists of extracted feature points and optimized points. This algorithm is able to produce coarse-to-fine models by controlling a general error level. But the error level of each ball may be adaptively adjusted according to the local curvature and density that can avoid holes generation during the simplification process. Finally, the simplified points are triangulated by Cocone algorithm for surface reconstruction. This algorithm has been applied to a set of large scanned models. Experimental results demonstrate that it can generate high-quality surface approximation with feature preservation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Point-based Tetrahedral Mesh Simplification with Intersection-Free Surface Mesh Simplification

Simplification of tetrahedral meshes is an important tool to decrease the complexity of these datasets. Many visualization systems need the simplified version of a mesh to be fully interactive. This paper presents a rapid tetrahedral simplifier that works in three steps. First, the border of the tetrahedral mesh is simplified. Second, the interior of the mesh is point sampled such that the resu...

متن کامل

Intrinsic point cloud simplification

Modelling and visualisation methods working directly with point-sampled geometry have developed into attractive alternatives to more traditional mesh-based surface processing. In this paper, we consider a vital step in any point-based surface processing pipeline, point cloud simplification. Building upon the intrinsic point cloud simplification idea put forward in [14], we obtain a simplificati...

متن کامل

A new point cloud simplification algorithm

We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user-controlled density guarantee. The algorithm is computationally and memory efficient, easy to implement...

متن کامل

Point Cloud Data Simplification Using Movable Mesh Generation

In order to realize massive point cloud data simplification, a new movable mesh generation algorithm was proposed. Firstly, point cloud model was divided into a number of spatial grids. Secondly, the mesh generation was made like the first step again but more finely and with respecting of the distance threshold, and then, each appropriate point of the grids generated by the second step was filt...

متن کامل

A Simple Yet Effective User Controllable Mesh Simplification

Mesh simplification has become a key ingredient for real-time graphics applications. However, practitioners have found that automatic simplification methods usually fail to produce satisfactory result when models of very low polygon count are desired. This is due to the fact that existing methods take no semantic or functional metric into account, and moreover, each error metric proposed previo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Trans. Computational Science

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2012